An SMT-Based Approach to Bounded Model Checking of Designs in State Transition Matrix

An SMT Approach to Bounded Reachability Analysis of Model Programs

Model programs represent transition systems that are used to specify expected behavior of systems at a high level of abstraction. The main application area is application-level network protocols or protocollike aspects of software systems. Model programs typically use abstract data types such as sets and maps, and comprehensions to express complex state updates. Such models are mainly used in m...

SMT-Based Model Checking

Table-based Software Designs: Bounded Model Checking and Counterexample Tracking

Model description languages used by most software model checkers are typically program-like languages such as the Promela language for the well-known model checker Spin. To promote practical use of model checking techniques in on-site software development, we realized, however, that graphicalized modeling languages (e.g., representatively, UML) are more easily acceptable compared to model-check...

Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking

In this paper, we present a Satisfiability Modulo Theory based (SMT-based) bounded model checking (BMC) method for Timed Real-Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic. SMT-based bounded model checking consists in translating the existential model checking problem for a modal logic and for a model to the satisfiability problem...

Checking RTECTL Properties of STSs via SMT-Based Bounded Model Checking